Infinitesimal Convexity Implies Local Convexity
نویسندگان
چکیده
منابع مشابه
Projective Convexity in P Implies Grassmann Convexity
In this note we introduce the notion of Grassmann convexity analogous to the wellknown notion of convexity for curves in real projective spaces. We show that the curve in G2,4 osculating to a convex closed curve in P is Grassmann-convex. This proves that the tangent developable (i.e. the hypersurface formed by all tangents) of any convex curve in P has the ‘degree’ equal to 4. Here by ‘degree’ ...
متن کاملRestricted Strong Convexity Implies Weak Submodularity
We connect high-dimensional subset selection and submodular maximization. Our results extend the work of Das and Kempe (2011) from the setting of linear regression to arbitrary objective functions. For greedy feature selection, this connection allows us to obtain strong multiplicative performance bounds on several methods without statistical modeling assumptions. We also derive recovery guarant...
متن کاملLocal Polynomial Convexity
We begin with the following question: given a closed disc D ⋐ C and a complex-valued function F ∈ C(D), is the uniform algebra on D generated by z and F equal to C(D) ? This question is complicated by the presence of points in the surface S := graph D (F) that have complex tangents. Such points are called CR singularities. Let p ∈ S be a CR singularity at which the order of contact of the tange...
متن کاملNear convexity, metric convexity, and convexity
It is shown that a subset of a uniformly convex normed space is nearly convex if and only if its closure is convex. Also, a normed space satisfying a mild completeness property is strictly convex if and only if every metrically convex subset is convex. 1 Classical and constructive mathematics The arguments in this paper conform to constructive mathematics in the sense of Errett Bishop. This mea...
متن کاملOn local convexity in graphs
A set K of nodes of a graph G is geodesically convex (respectively, monophonically convex) if K contains every node on every shortest (respectively, chordless) path joining nodes in K. We investigate the classes of graphs which are characterized by certain local convexity conditions with respect to geodesic convexity, in particular, those graphs in which balls around nodes are convex, and those...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indiana University Mathematics Journal
سال: 1974
ISSN: 0022-2518
DOI: 10.1512/iumj.1975.24.24014